Flat matching
نویسندگان
چکیده
منابع مشابه
Flat matching
We study matching in flat theories both from theoretical and practical points of view. A flat theory is defined by the axiom f(x, f(y), z) . = f(x, y, z) that indicates that nested occurrences of the function symbol f can be flattened out. From the theoretical side, we design a procedure to solve a system of flat matching equations and prove its soundness, completeness, and minimality. The mini...
متن کاملFlat Nonholonomic Matching
In this paper we extend the matching technique to a class of nonholonomic systems with symmetries. Assuming that the momentum equation defines an integrable distribution, we introduce a family of reduced systems. The method of controlled Lagrangians is then applied to these systems resulting in a smooth stabilizing controller.
متن کاملPROJECT DESCRIPTION Stabilitiy, Matching and Sensitivity of Flat Beams
The International Linear Collider (ILC) is expected to begin a new era of discovery in elementary particles and high energy physics. To make this new advanced accelerator a reality, many critical R&D needs must be addressed. One of them is the in-depth understanding, and control, of the dynamics of the flat beam that the ILC damping rings are designed to produce. This advanced accelerator will ...
متن کاملWhen every $P$-flat ideal is flat
In this paper, we study the class of rings in which every $P$-flat ideal is flat and which will be called $PFF$-rings. In particular, Von Neumann regular rings, hereditary rings, semi-hereditary ring, PID and arithmetical rings are examples of $PFF$-rings. In the context domain, this notion coincide with Pr"{u}fer domain. We provide necessary and sufficient conditions for...
متن کاملFast Least Square Matching
Least square matching (LSM) is one of the most accurate image matching methods in photogrammetry and remote sensing. The main disadvantage of the LSM is its high computational complexity due to large size of observation equations. To address this problem, in this paper a novel method, called fast least square matching (FLSM) is being presented. The main idea of the proposed FLSM is decreasing t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2008
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2008.05.001